An important problem for the WiMAX networks is how to provide a guaranteed quality of service for applications. A key aspect of this problem is how BSs should share Bandwidth capacity between different classes of traffic. This decision needs to be made for each incoming packet, and is known as the packet scheduling problem.A major challenge in packet scheduling is that the behavior of each traffic class may not be known in advance, and can vary dynamically.In this paper, we describe how we have modeled the packet scheduling problem as an application for reinforcement learning (RL). We demonstrate how our RL approach can learn scheduling policies that satisfy the quality of service requirements of multiple traffic classes under a variety of conditions. The proposed solution has been designed to have an ability to accommodate integrated traffic in the networks with effective scheduling schemes. A series of simulation experiments have been carried out to evaluate the performance of the proposed scheduling algorithm. The results reveal that the proposed solution performs effectively to the integrated traffic composed of messages with or without time constraints and achieves proportional fairness among different types of traffic.

There are several ways for Bandwidth Allocation for users acting based on policy of network administrators in computer networks. Due to the diversity of users and so amount of Bandwidth usage per user, providing suitable Bandwidth rate to meet their needs in various situations play an important role in terms of performance and implementation of Bandwidth management systems. In this paper, we propose a dynamic and balanced approach, called normal weight Allocation for determining amount of Bandwidth for each user taking into account the importance of user in caomparision with other online concurrent users. In this regard, to obtain a user weight as the importance of user, we apply Fuzzy AHP technique for eliciting indecisive expert ideas. Ease of implementation and taking the advantage of maximal usage of available Bandwidth are the features of the proposed approach.

Due to lack of resources such as transmission power and Bandwidth in satellite systems, resource Allocation problem is a very important challenge. Nowadays, new heterogeneous network includes one or more satellites besides terrestrial infrastructure, so that it is considered that each satellite has multi-beam to increase capacity. This type of structure is suitable for a new generation of communications, which leads to a specific benefit of using the available resource in wireless communication systems. The multi-beam technology is one of the multiple access methods for new satellite systems that are similar to very high throughput satellites systems. Therefore, in this paper, our proposed algorithm is mainly the jointly power and Bandwidth Allocation of satellite systems to each beam and it is simulated considering the limitation of the total transmission power and Bandwidth constraints for any beams. Furthermore, a Bandwidth sharing algorithm is provided to dedicate extra Bandwidth among beams. Finally, the total capacity of our proposed system model, which is heterogeneous network is obtained based on some parameters such as frequency reuse, modulation rate and total number of users for each beam. This comparison shows that the proposed algorithm allows maintaining the optimal capacity Allocation to use a new satellite network.

Data-Over-Cable Service Interface Specifications) DOCSIS) is developed for data transmissions over cable networks. DOCSIS is intended to support IP flows with significantly higher data rate links for high quality data, audio, video and interactive services. It is important to provide traffic scheduling mechanisms to support Quality of Service (QoS) for such applications. DOCSIS defines six upstream services for supporting per-flow QoS. Among them it uses rt-PS service for real-time VBR traffic which has burst nature. The Headend provides periodic opportunities for unicast request, namely polling, which yields higher delay and not suitable for real-time services. In this paper, a novel scheduling mechanism and Bandwidth Allocation algorithm has been proposed to support VBR multimedia traffic over DOCSIS. The proposed Dynamic Unsolicited Grant Service) DUGS) scheduling algorithm makes use of piggybacking request and changes the unsolicited grant size Allocation dynamically. It is shown through simulation results that throughput, channel utilization and delay performance have been improved in case of DUGS, compared with current DOCSIS protocol. This algorithm can also keep fairness among connections.

In this paper, the pricing and Bandwidth Allocation in heterogeneous wireless access networks is studied. Demand modeling and resource Allocation in heterogeneous wireless access networks is carried out using the theories of microeconomics in competitive markets. A competitive market model for Bandwidth Allocation and pricing is presented where new relaxation models and propositions are developed to address various aspects of the operation of wirless access networks such as roaming and hand off control. We used the existing market theories to develop a solution for pricing of a unit of Bandwidth of each network based on the marginal cost of the product. The client preferences with regard to available networks are also modeled in our network market model. On the other hand, network providers also adjust their product offering according to the market price. We prove that the user and Bandwidth assignment made on the basis of this model where all agents have rational behavior is Pareto optimum that maximizes the utility of networks and clients.

One of the key challenges in next generation access networks based on Ethernet Passive Optical Network (EPON) technology is Dynamic Bandwidth Allocation (DBA) process. In this paper we have proposed ‘Parnian’, a two-stage nested-auction for dynamic Bandwidth Allocation management in Ethernet Passive Optical Networks. In the proposed ‘Parnian’ method, by running nested auction, based on EPON architecture, the Optical Network Units locally optimize the users' Bandwidth requests by first stage auction and then the Optical Line Terminal runs the second stage auction for allocating the requested Bandwidths dynamically and effectively. Simulation results show that ‘Parnian’, in comparison with the Fair Sharing with Dual Service Level Agreement (FSD-SLA) and limited service Interleaved polling with adaptive cycle time (IPACT) experiences more delay, but regarding other quality of service parameters such as execution time, packet loss ratio, line utilization, and throughput, it has a better performance.

In the foreseeable future, networks of access devices that can cooperate and effectively communicate with military backbone infrastructure will significantly influence and simplify military operations. As one of the promising solutions for developing next generation military networks, Ethernet Passive Optical Network (EPON) has received great attention from both industry and academia in recent years. Based on the EPON technology, Bandwidth constraint is a critical issue in military communication. In this paper we propose Peris, a novel dynamic Bandwidth Allocation method with second price auction in next generation military networks based on EPON technology. In this new method, the OLT (similar to the leaders) is responsible for the auction management which effectively and fairly responds to the Bandwidth requests of the users through their own ONUs and allocates the winners the amount of requested available Bandwidth. Simulation results show that comparing Peris with IPACT, regarding QoS parameters such as packet loss ratio, line utilization and throughput, it has better performance.

One of the obvious reasons for most disorders in network service provisioning is network path congestion. Congestion avoidance in today's networks is too costly and sometimes impossible. With the introduction of SDN, centralizing the equipment's control plane has become possible. This paper presents an enhanced method named ESV-DBRA to avoid congestion in multi-tenant SDN networks. At first, ESV-DBRA monitors the traffic load and delay of all network paths for each tenant individually. Then, by merging the parameters obtained from the monitoring, the Service Level Agreements (SLA), and a novel proposed cost function, it calculates the cost of the network paths per tenant. As a result, traffic for each tenant is routed through the path/paths at the lowest possible cost from the tenant's perspective. Next, the Bandwidth quotas will be calculated and assigned to the tenants over their optimal routes. Afterward, whenever congestion is likely to occur in a path, ESV-DBRA automatically changes the route or Bandwidth of the tenants' traffic related to this path to avoid congestion. Related algorithms are also proposed.Eventually, simulations show that the proposed method effectively increases Bandwidth utilization by 10.76%.